Complete graph

Results: 868



#Item
51Sensor Networks Continue to Puzzle: Selected Open Problems Thomas Locher, Pascal von Rickenbach, and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland {lochert, pascalv, wattenhofer}

Sensor Networks Continue to Puzzle: Selected Open Problems Thomas Locher, Pascal von Rickenbach, and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland {lochert, pascalv, wattenhofer}

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:15:52
52

PDF Document

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2014-06-26 02:33:00
53New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ † Archontia C. Giannopoulou‡ §

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ † Archontia C. Giannopoulou‡ §

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-05-11 15:56:58
54Noname manuscript No. (will be inserted by the editor) A portable parallel implementation of the lrs vertex enumeration code David Avis and Gary Roumanis

Noname manuscript No. (will be inserted by the editor) A portable parallel implementation of the lrs vertex enumeration code David Avis and Gary Roumanis

Add to Reading List

Source URL: cgm.cs.mcgill.ca

Language: English - Date: 2013-11-01 11:17:39
55METRICALLY HOMOGENEOUS GRAPHS OF DIAMETER THREE DANIELA AMATO, GREGORY CHERLIN, AND H. DUGALD MACPHERSON Abstract. We classify countable metrically homogeneous graphs of diameter 3.

METRICALLY HOMOGENEOUS GRAPHS OF DIAMETER THREE DANIELA AMATO, GREGORY CHERLIN, AND H. DUGALD MACPHERSON Abstract. We classify countable metrically homogeneous graphs of diameter 3.

Add to Reading List

Source URL: www1.maths.leeds.ac.uk

Language: English - Date: 2016-06-30 08:12:01
56The giant component in a random subgraph of a given graph Fan Chung1 ? , Paul Horn1 , and Linyuan Lu2 1 ??

The giant component in a random subgraph of a given graph Fan Chung1 ? , Paul Horn1 , and Linyuan Lu2 1 ??

Add to Reading List

Source URL: web.cs.du.edu

Language: English - Date: 2010-11-16 11:14:05
57Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1  Max Planck Institute for Informatics, .d

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:46:12
58Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1  Max-Planck-Institut f¨

Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:45:52
59Cryptographic Protocols Spring 2015 Slides for Chapter 1 (6th lecture)  Hamiltonian cycles

Cryptographic Protocols Spring 2015 Slides for Chapter 1 (6th lecture) Hamiltonian cycles

Add to Reading List

Source URL: www.crypto.ethz.ch

Language: English - Date: 2015-03-30 06:00:41
60Microsoft PowerPoint - Presentation2

Microsoft PowerPoint - Presentation2

Add to Reading List

Source URL: web.cse.ohio-state.edu

Language: English - Date: 2009-01-27 18:47:33